An algorithm for solving fuzzy relation programming with the max-t composition operator

This paper studies the problem of minimizing a linear objective function subject to max-T fuzzy relation equation constraints where T is a special class of pseudot-norms. Some sufficient conditions are presented for determination of its optimal solutions. Some procedures are also suggested to simplify the original problem. Some sufficient conditions are given for uniqueness of its optimal solution. Finally, an algorithm is proposed to find its optimal solution.Publisher's Versio

Monomial geometric programming with fuzzy relation equation constraints regarding max-bounded difference composition operator

In this paper, an optimization model with an objective function as monomial subject to a system of the fuzzy relation equations with max-bounded difference (maxBD) composition operator is presented. We firstly determine its feasible solution set. Then some special characteristics of its feasible domain and the optimal solutions are studied. Some procedures for reducing and decomposing the problem into several subproblems with smaller dimensions are proposed. Finally, an algorithm is designed to optimize the objective function of each sub-problem.Publisher's Versio

Resolution of an inverse parabolic problem using sinc-galerkin method

In this paper, a numerical method is proposed to solve an Inverse Heat Conduction Problem (IHCP) using noisy data based on Sinc-Galerkin method. A stable numerical solution is determined for the problem. To do this, we use a sensor located at a point inside the body and measure u(x, t) at a point x = a, where 0 < a < 1. We also show that the rate of convergence of the method is as exponential. The numerical results show the efficiency of our approach to estimate the unknown functions of the inverse problem. The function can be computed within a couple of minutes CPU time at pentium IV-2.7 GHz PC.Publisher's Versio

The semiring-theoretic approach to MV-algebras: a survey

In this paper we review some of the main achievements of the semiring-theoretic approach to MV-algebras initiated and pursued mainly by the present authors and their collaborators. The survey focuses mainly on the connections between MV-algebras and other theories that such a semiringbased approach enabled, and on an application of such a framework to Digital Image Processing. We also give some suggestions for further developments by stating several open problems and possible research lines.Comment: Published versio

MINIMIZING A LINEAR OBJECTIVE FUNCTION SUBJECT TO FUZZY RELATION EQUATIONS CONSTRAINTS WITH MAX-HAMACHER PRODUCT COMPOSITION

In this paper, an optimization model with a linear objective function subject to a system of fuzzy relation equations, using max-Hamacher product composition operator, is presented. Since its nonempty feasible solution set is in general a nonconvex set, conventional linear programming methods are not suitable to solve such a problem, so an efficient solution procedure for such problems is necessary. In this paper, the feasible solution set of this problem is studied at first. Then, one efficient algorithm (i.e. tabular method algorithm) is proposed in order to solve the problem. Some procedures are also presented to reduce the original problem. Then, the reduced problem is decomposed (if possible) into several sub-problems with smaller dimensions, so solving them becomes very easier by the algorithm. By combining the algorithm and these procedures, another more efficient algorithm is suggested in order to obtain the optimal solution of the original problem. Some numerical examples are also given to illustrate the algorithms.Fuzzy relation equation, max-Hamacher product composition, linear objective function minimization problem

LINEAR PROGRAMMING PROBLEM WITH INTERVAL COEFFICIENTS AND AN INTERPRETATION FOR ITS CONSTRAINTS

Abstract – In this paper, we introduce a Satisfaction Function (SF) to compare interval values on the basis of Tseng and Klein’s idea. The SF estimates the degree to which arithmetic comparisons between two interval values are satisfied. Then, we define two other functions called Lower and Upper SF based on the SF. We apply these functions in order to present a new interpretation of inequality constraints with interval coefficients in an interval linear programming problem. This problem is as an extension of the classical linear programming problem to an inexact environment. On the basis of definitions of the SF, the lower and upper SF and their properties, we reduce the inequality constraints with interval coefficients in their satisfactory crisp equivalent forms and define a satisfactory solution to the problem. Finally, a numerical example is given and its results are compared with other approaches

Linear optimization with bipolar max-parametric hamacher fuzzy relation equation constraints

summary:In this paper, the linear programming problem subject to the Bipolar Fuzzy Relation Equation (BFRE) constraints with the max-parametric hamacher composition operators is studied. The structure of its feasible domain is investigated and its feasible solution set determined. Some necessary and sufficient conditions are presented for its solution existence. Then the problem is converted to an equivalent programming problem. Some rules are proposed to reduce the dimensions of problem. Under these rules, some of the optimal variables are found without solving the problem. An algorithm is then designed to find an upper bound for its optimal objective value. With regard to this algorithm, a modified branch and bound method is extended to solve the problem. We combine the rules, the algorithm, and the modified branch and bound method in terms of an algorithm to solve the original problem